Beta-coalescents and continuous stable random trees
نویسندگان
چکیده
Coalescents with multiple collisions, also known as Λ-coalescents, were introduced by Pitman and Sagitov in 1999. These processes describe the evolution of particles that undergo stochastic coagulation in such a way that several blocks can merge at the same time to form a single block. In the case that the measure Λ is the Beta(2 − α, α) distribution, they are also known to describe the genealogies of large populations where a single individual can produce a large number of offspring. Here we use a recent result of Birkner et al. to prove that Beta-coalescents can be embedded in continuous stable random trees, about which much is known due to recent progress of Duquesne and Le Gall. Our proof is based on a construction of the Donnelly-Kurtz lookdown process using continuous random trees which is of independent interest. This produces a number of results concerning the small-time behavior of Beta-coalescents. Most notably, we recover an almost sure limit theorem of the authors for the number of blocks at small times, and give the multifractal spectrum corresponding to the emergence of blocks with atypical size. Also, we are able to find exact asymptotics for sampling formulae corresponding to the site frequency spectrum and allele frequency spectrum associated with mutations in the context of population genetics. MSC Primary 60J25; Secondary 60J80, 60J85, 60K99, 92D10
منابع مشابه
Beta-coalescents in continuum Lévy trees
Considering a random binary tree with n labelled leaves, we use a pruning procedure on this tree in order to construct a Beta(3/2, 1/2)coalescent process. We also use the continuous analogue of this construction, i.e. a pruning procedure on Aldous’s continuumrandom tree, to construct a continuous state space process that has the same structure as the beta-coalescent process up to some time chan...
متن کاملSmall-time behavior of beta coalescents
For a finite measure Λ on [0, 1], the Λ-coalescent is a coalescent process such that, whenever there are b clusters, each k-tuple of clusters merges into one at rate ∫ 1 0 x(1− x) Λ(dx). It has recently been shown that if 1 < α < 2, the Λ-coalescent in which Λ is the Beta(2−α, α) distribution can be used to describe the genealogy of a continuous-state branching process (CSBP) with an α-stable b...
متن کاملInvited Talks
Bénédicte Haas, University of Paris-Dauphine, France Limits of Non-increasing Markov Chains and Applications to Random Trees and Coalescents Consider a non-increasing Markov chain with values in the set of non-negative integers, starting from a large integer !. We describe its scaling limit as ! → ∞, under the assumption that the large jump events are rare and happen at rates that behave like a...
متن کاملAlpha-stable Branching and Beta-Coalescents
We determine that the continuous-state branching processes for which the genealogy, suitably time-changed, can be described by an autonomous Markov process are precisely those arising from α-stable branching mechanisms. The random ancestral partition is then a time-changed Λ-coalescent, where Λ is the Beta-distribution with parameters 2− α and α, and the time change is given by Z1−α, where Z is...
متن کاملEternal Additive Coalescents and Certain Bridges with Exchangeable Increments
Aldous and Pitman have studied the asymptotic behavior of the additive coalescent processes using a nested family random forests derived by logging certain inhomogeneous continuum random trees. Here we propose a different approach based on partitions of the unit interval induced by certain bridges with exchangeable increments. The analysis is made simple by an interpretation in terms of an aggr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996